An efficient decoding technique for Huffman codes
نویسندگان
چکیده
منابع مشابه
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [...
متن کاملSub-linear Decoding of Huffman Codes Almost In-place
We present a succinct data structure storing the Hu man encoding that permits sub linear decoding in the number of transmitted bits The size of the extra storage except for the storage of the symbols in the alphabet for the new data structure is O l logN bits where l is the longest Hu man code and N is the number of symbols in the alphabet We present a solution that typically decodes texts of s...
متن کاملAn analog VLSI decoding technique for digital codes
The design of various high-speed interface architectures for off-chip connections to and from analog, iterative VLSI decoders is discussed. It is shown that for applications with high transmission rates and low to medium accuracy, MOSFET-only R-2R ladders in combination with switched-current memory cells are ideally suited, due to their current mode nature as well as their power and area effici...
متن کاملA Work Efficient Parallel Algorithm for Constructing Huffman Codes
Given an tilphabet C = (al! . . . , a,) and a corresponding list of weights [WI, . . . , w,], a Huffman code for this alphabet is a prefix code that minimizes the weighted length of a code string, defined to be Cr.., wili, where li is the length of the code assigned to ai. A. Huffman code can be generated in O(n log n) time for an unsorted list of weights alld in Cl(n) time if the weights are a...
متن کاملEfficient Decoding Techniques for LDPC Codes
Efficient decoding techniques for LDPC codes are in demand, since these codes are included in many standards nowadays. Although the theoretical performance of LDPC codes is impressive, their practical implementation leads to problems like numerical inaccuracy, limited memory resources, etc. We investigate methods that are suited to reduce the decoding complexity while still keeping the loss in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2002
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00243-5